InforLorV4, Main, Exploration, bibRecord, 002805

Proving weak properties of rewriting

Identifieur interne : 002805 ( Main/Exploration ); précédent : 002804; suivant : 002806

Proving weak properties of rewriting

Auteurs : Isabelle Gnaedig [France] ; Hélène Kirchner [France]

Source :

Theoretical computer science [ 0304-3975 ] ; 2011.

RBID : Pascal:11-0441752

Descripteurs français

Pascal (Inist)
- Informatique théorique, Réécriture, Programmation, Borne électrique, Réductibilité, Preuve, Arbre, Evaluation, Entrée ordinateur, Backtracking, Complétude, Induction, 68Q42, Terminaison programme, 05C05, Sous terme.
Wicri :
- topic : Preuve, Arbre.

English descriptors

KwdEn :
- Backtracking, Completeness, Computer theory, Evaluation, Induction, Input, Programming, Proof, Reducibility, Rewriting, Termination, Tree.
mix :
- abstraction, completeness, induction, narrowing, rewriting, weak termination.

Abstract

In rule-based programming, properties of programs, such as termination, are in general considered in their strong acceptance, i.e., on every computation branch. But in practice, they may hold in their weak acceptance only, i.e., on at least one computation branch. Moreover, weak properties are often enough to ensure that programs give the expected result. There are very few results to handle weak properties of rewriting. We address here two of them: termination and reducibility to a constructor form, in a unified framework allowing us to prove them inductively. Proof trees are developed, which simulate rewriting trees by narrowing and abstracting subterms. Our technique is constructive in the sense that proof trees can be used to infer an evaluation strategy for any given input: the right computation branch is developed without using a costly breadth-first strategy nor backtracking.

Url:

https://hal.inria.fr/inria-00592271

Affiliations:

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Proving weak properties of rewriting</title>
<author><name sortKey="Gnaedig, Isabelle" sort="Gnaedig, Isabelle" uniqKey="Gnaedig I" first="Isabelle" last="Gnaedig">Isabelle Gnaedig</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>INRIA & LORIA (UMR 7503 CNRS-INPL-INRIA-Nancy 2-UHP), Campus Scientifique, BP 239</s1>
<s2>54506 Vandoeuvre-lés-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>INRIA, Centre de Recherche INRIA Bordeaux - Sud-Ouest, Bâilment A29. 351, Cours de la Libération</s1>
<s2>33405 Talence</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Nouvelle-Aquitaine</region>
<region type="old region" nuts="2">Aquitaine</region>
<settlement type="city">Talence</settlement>
</placeName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">11-0441752</idno>
<date when="2011">2011</date>
<idno type="stanalyst">PASCAL 11-0441752 INIST</idno>
<idno type="RBID">Pascal:11-0441752</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000138</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000875</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000125</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000125</idno>
<idno type="wicri:doubleKey">0304-3975:2011:Gnaedig I:proving:weak:properties</idno>
<idno type="wicri:Area/Main/Merge">002849</idno>
<idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00592271</idno>
<idno type="url">https://hal.inria.fr/inria-00592271</idno>
<idno type="wicri:Area/Hal/Corpus">003E44</idno>
<idno type="wicri:Area/Hal/Curation">003E44</idno>
<idno type="wicri:Area/Hal/Checkpoint">002020</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">002020</idno>
<idno type="wicri:doubleKey">0304-3975:2011:Gnaedig I:proving:weak:properties</idno>
<idno type="wicri:Area/Main/Merge">002550</idno>
<idno type="wicri:Area/Main/Curation">002805</idno>
<idno type="wicri:Area/Main/Exploration">002805</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Proving weak properties of rewriting</title>
<author><name sortKey="Gnaedig, Isabelle" sort="Gnaedig, Isabelle" uniqKey="Gnaedig I" first="Isabelle" last="Gnaedig">Isabelle Gnaedig</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>INRIA & LORIA (UMR 7503 CNRS-INPL-INRIA-Nancy 2-UHP), Campus Scientifique, BP 239</s1>
<s2>54506 Vandoeuvre-lés-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>INRIA, Centre de Recherche INRIA Bordeaux - Sud-Ouest, Bâilment A29. 351, Cours de la Libération</s1>
<s2>33405 Talence</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Nouvelle-Aquitaine</region>
<region type="old region" nuts="2">Aquitaine</region>
<settlement type="city">Talence</settlement>
</placeName>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
<imprint><date when="2011">2011</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Backtracking</term>
<term>Completeness</term>
<term>Computer theory</term>
<term>Evaluation</term>
<term>Induction</term>
<term>Input</term>
<term>Programming</term>
<term>Proof</term>
<term>Reducibility</term>
<term>Rewriting</term>
<term>Termination</term>
<term>Tree</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Informatique théorique</term>
<term>Réécriture</term>
<term>Programmation</term>
<term>Borne électrique</term>
<term>Réductibilité</term>
<term>Preuve</term>
<term>Arbre</term>
<term>Evaluation</term>
<term>Entrée ordinateur</term>
<term>Backtracking</term>
<term>Complétude</term>
<term>Induction</term>
<term>68Q42</term>
<term>Terminaison programme</term>
<term>05C05</term>
<term>Sous terme</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Preuve</term>
<term>Arbre</term>
</keywords>
<keywords scheme="mix" xml:lang="en"><term>abstraction</term>
<term>completeness</term>
<term>induction</term>
<term>narrowing</term>
<term>rewriting</term>
<term>weak termination</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">In rule-based programming, properties of programs, such as termination, are in general considered in their strong acceptance, i.e., on every computation branch. But in practice, they may hold in their weak acceptance only, i.e., on at least one computation branch. Moreover, weak properties are often enough to ensure that programs give the expected result. There are very few results to handle weak properties of rewriting. We address here two of them: termination and reducibility to a constructor form, in a unified framework allowing us to prove them inductively. Proof trees are developed, which simulate rewriting trees by narrowing and abstracting subterms. Our technique is constructive in the sense that proof trees can be used to infer an evaluation strategy for any given input: the right computation branch is developed without using a costly breadth-first strategy nor backtracking.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
<region><li>Aquitaine</li>
<li>Grand Est</li>
<li>Lorraine (région)</li>
<li>Nouvelle-Aquitaine</li>
</region>
<settlement><li>Talence</li>
<li>Vandœuvre-lès-Nancy</li>
</settlement>
</list>
<tree><country name="France"><region name="Grand Est"><name sortKey="Gnaedig, Isabelle" sort="Gnaedig, Isabelle" uniqKey="Gnaedig I" first="Isabelle" last="Gnaedig">Isabelle Gnaedig</name>
</region>
<name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002805 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002805 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     Pascal:11-0441752
   |texte=   Proving weak properties of rewriting
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

Serveur d'exploration sur la recherche en informatique en Lorraine

Proving weak properties of rewriting

Proving weak properties of rewriting

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.